On the Dual Relationship between Markov Chains of Gi/m/1 and M/g/1 Type
نویسندگان
چکیده
In 1990 Ramaswami proved that, given a Markov renewal process of M/G/1– type, one can construct a Markov renewal process of GI/M/1–type such that the matrix transforms G(z, s) for the M/G/1–type process and R(z, s) for the GI/M/1–type process satisfy a duality relationship. In his 1996 PhD thesis, Bright used time reversal arguments to show that it is possible to define a different dual for positive-recurrent and transient processes of M/G/1–type and GI/M/1–type. Here we compare the properties of the Ramaswami and Bright dual processes and show that the Bright dual has desirable properties that can be exploited in the design of algorithms for the analysis of Markov chains of GI/M/1–type and M/G/1–type.
منابع مشابه
Determination of Explicit Solution for a General Class of Markov Processes
In this paper, we study both the GI=M=1 type and the M=G=1 type Markov chains with the special structure A 0 = !. We obtain explicit formulas for matrices R and G, which generalized earlier results on Markov chains of QBD type. In the case of GI=M=1 type, we show how to nd the maximal eigenvalue of R, and then that the computation of R is equivalent to that of x 2. In the case of M=G=1 type, we...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملA Fixed Point Approach to the Classification of Markov Chains with a Tree Structure
In this paper, we study the classification problem of discrete time and continuous time Markov processes with a tree structure. We first show some useful properties associated with the fixed points of a nondecreasing mapping. Mainly we find the conditions for a fixed point to be the minimal fixed point by using fixed point theory and degree theory. We then use these results to identify conditio...
متن کاملA fast Newton’s iteration for M/G/1-type and GI/M/1-type Markov chains
In this paper we revisit Newton’s iteration as a method to find the G or R matrix in M/G/1type and GI/M/1-type Markov chains. We start by reconsidering the method proposed in [14] which required O(m +Nm) time per iteration, and show that it can be reduced to O(Nm), where m is the block size and N the number of blocks. Moreover, we show how this method is able to further reduce this time complex...
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009